Colored Petri Net inversion for Backward Reachability Analysis

نویسندگان

  • Mohamed BOUALI
  • Pavol BARGER
  • Walter SCHON
چکیده

Colored Petri Nets (CPN) are a powerful, recognized and intuitive modelling tool. They allow a precise representation of distributed, embedded and/or real time systems. These models can be then used among others for the dependability assessment. This paper develops a new method of CPN analysis called the Backward reachability. It provides information about different ways of reaching a particular CPN marking that represents, for example, a failure state or a transilient fault. This analysis is performed on an inverse CPN which is obtained by transforming original CPN structure while preserving the model proprieties. The work develops mathematical tools to prove the pertinence of transformations allowing the definition of inverse CPN. The main advantage of this method is that it allows to determine the sequence leading from the initial to the final marking for any possible final marking vector.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Towards an Efficient Structural Analysis of Colored Petri Nets

This paper presents the Backward reachability which is a structural analysis method applicable to Colored Petri Nets (CPN). This method avoids the fastidious computation of simulation and the combinatorial explosion of reachable state space. The backward reachability provides the information about different ways of reaching a particular CPN marking. This evaluation considers the evolution of ma...

متن کامل

Backward reachability of Colored Petri Nets for systems diagnosis

Embedded systems development creates a need of new design, verification and validation technics. Formal methods appear as a very interesting approach for embedded systems analysis, especially for dependability studies. The chosen formalism for this work is based on Colored Petri Net (CPN)for two main reasons : the expressivity and the formal nature. Also, they model easily the static and the dy...

متن کامل

Backward Reachability Analysis of Colored Petri Nets

This paper deals with a formal method for the study of the backward reachability analysis applied on Colored Petri Nets (CPN). The proposed method proceeds in two steps : 1) it translates CPN to terms of the Multiplicative Intuitionistic Linear Logic (MILL); 2) it proves sequents by constructing proof trees. The translation from CPN to MILL must respect some properties such as the semantic asso...

متن کامل

Application of linear logic to Backward Reachability Analysis of Colored Petri Nets

This paper deals with a formal method for the study of the backward reachability analysis applied on Colored Petri Nets (CPN). The proposed method proceeds in two steps : 1) it translates CPN to terms of the Multiplicative Intuitionistic Linear Logic (MILL); 2) it proves sequents by constructing proof trees. The translation from CPN to MILL must respect some properties such as the semantic asso...

متن کامل

B-W Analysis: A Backward Reachability Analysis for Diagnostic Problem Solving Suitable to Parallel Implementation

Backward reachability on Petri net models has been proposed since the beginning of the development of net theory without giving it a suitable motivation. For this reason, reachability analysis has been successively developed essentially by taking into account forward reachability. In this paper backward reachability analysis is motivated by showing its suit-ability to diagnostic problem solving...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010